Use DG-methods to build a matrix factorization
نویسندگان
چکیده
Let P be a commutative Noetherian ring, ???? an ideal of which is generated by regular sequence length four, f element P, and P¯ the hypersurface ring P?(f). Assume that ????:f grade four Gorenstein P. We give resolution N P¯?????P¯ free P¯-modules. The built from differential graded algebra P?(????:f) P-modules, together with one homotopy map. In particular, we explicit form for matrix factorization infinite tail N.
منابع مشابه
Polynomial Optimization Methods for Matrix Factorization
Matrix factorization is a core technique in many machine learning problems, yet also presents a nonconvex and often difficult-to-optimize problem. In this paper we present an approach based upon polynomial optimization techniques that both improves the convergence time of matrix factorization algorithms and helps them escape from local optima. Our method is based on the realization that given a...
متن کاملDescent methods for Nonnegative Matrix Factorization
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method called Rank-one Residue Iteration (RRI). We also give a comparison of these different methods and show that the new block coordinate method has better properties in terms of approximation error and complexity. By interpreting...
متن کاملRelation Extraction using Matrix Factorization Methods
Relation extraction has an important role within the information extraction domain. Given an initial ontology specifying noun categories, instances from these categories and text corpora, the relation extraction task consists of extracting the relations that connect instances from these categories. Current research works related with this topic, are mostly based on the clustering methods. One w...
متن کاملProjected Gradient Methods for Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although bound-constrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this letter, we propose two projected gradient methods for NMF, both of which exhibit strong optimization properties. We discuss ...
متن کاملMatrix factorization methods for integrative cancer genomics.
With the rapid development of high-throughput sequencing technologies, many groups are generating multi-platform genomic profiles (e.g., DNA methylation and gene expression) for their biological samples. This activity has generated a huge number of so-called "multidimensional genomic datasets," providing unique opportunities and challenges to study coordination among different regulatory levels...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Commutative Algebra
سال: 2022
ISSN: ['1939-0807', '1939-2346']
DOI: https://doi.org/10.1216/jca.2022.14.229